A NOTE ON W-REGULAR LANGUAGESTAKAHASHI M; YAMASAKI H.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 217-225; BIBL. 6 REF.Article

TRIANGLE CELLULAR AUTOMATADYER CR; ROSENFELD A.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 1; PP. 54-69; BIBL. 3 REF.Article

A TRANSLATIONAL THEOREM FOR THE CLASS OF EOL LANGUAGESENGELFRIET J; ROZENBERG G.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 50; NO 2; PP. 175-183; BIBL. 10 REF.Article

Compilation efficace d'une classe de langages sans affectations = Efficient compilation of a languages classe without affectationsHOOGVORST, Philippe.1983, 206 pThesis

One-way multihead finite automata are not closed under concatenationDURIS, P; HROMKOVIC, J.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 121-125, issn 0304-3975Article

On real time and linear time cellular automataBUCHER, W; CULIK, K. II.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 307-325, issn 0399-0540Article

A homomorphic characterization of recursively enumerable languagesHIROSE, S; OKAWA, S; YONEDA, M et al.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 261-269, issn 0304-3975Article

On the correspondence between two classes of reduction systemsTHATTE, S. R.Information processing letters. 1985, Vol 20, Num 2, pp 83-85, issn 0020-0190Article

On restricting the size of oracles compared with restricting access to oraclesLONG, T. J.SIAM journal on computing (Print). 1985, Vol 14, Num 3, pp 585-597, issn 0097-5397Article

Subset languages of Petri nets. II: Closure propertiesROZENBERG, G; VERRAEDT, R.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 85-108, issn 0304-3975Article

Elementary formal systems, intrinsic complexity, and procrastinationJAIN, S; SHARMA, A.Information and computation (Print). 1997, Vol 132, Num 1, pp 65-84, issn 0890-5401Article

Apprenabilité de Classes de Concepts Structurés = On the Learnability of Structural Concept ClassesJappy, Pascal; Gascuel, Olivier.1997, 114 p.Thesis

A fixed point characterization of cofinite languagesSemigroup forum. 1984, Vol 29, Num 3, pp 378-380, issn 0037-1912Article

Extended macro grammars and stack controlled machinesENGELFRIET, J; SLUTZKI, G.Journal of computer and system sciences (Print). 1984, Vol 29, Num 3, pp 366-408, issn 0022-0000Article

On classes of tractable unrestricted regular expressionsLEISS, E.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 313-327, issn 0304-3975Article

On the complexity of iterated shuffleWARMUTH, M. K; HAUSSLER, D.Journal of computer and system sciences (Print). 1984, Vol 28, Num 3, pp 345-358, issn 0022-0000Article

Shuffle grammarsARAKI, T; TOKURA, N; KOSAI, S et al.Systems, computers, controls. 1983, Vol 14, Num 4, pp 37-45, issn 0096-8765Article

Inferring unions of the pattern languages by the most fitting coversYEN KAOW NG; SHINOHARA, Takeshi.Lecture notes in computer science. 2005, pp 269-282, issn 0302-9743, isbn 3-540-29242-X, 1Vol, 14 p.Conference Paper

Succinct circuit representations and leaf language classes are basically the same conceptBORCHERT, B; LOZANO, A.Information processing letters. 1996, Vol 59, Num 4, pp 211-215, issn 0020-0190Article

Reduction algorithms for some classes of a periodic monoidsKONIG, R.R.A.I.R.O. Informatique théorique. 1985, Vol 19, Num 3, pp 233-260, issn 0399-0540Article

Conjunctive grammars and alternating pushdown automataAIZIKOWITZ, Tamar; KAMINSKI, Michael.Acta informatica. 2013, Vol 50, Num 3, pp 175-197, issn 0001-5903, 23 p.Article

Learnable classes of general combinatory grammarsMOREAU, Erwan.Lecture notes in computer science. 2005, pp 189-204, issn 0302-9743, isbn 3-540-25783-7, 16 p.Conference Paper

On the inclusion problem for finitely ambiguous rational trace languagesBERTONI, A; MASSAZZA, P.Informatique théorique et applications (Imprimé). 1998, Vol 32, Num 1-3, pp 79-98, issn 0988-3754Article

On solving star equationsLEISS, E. L.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 327-332, issn 0304-3975Article

Parameterized Modules for Classes and Extensible FunctionsLEE, Keunwoo; CHAMBERS, Craig.Lecture notes in computer science. 2006, pp 353-378, issn 0302-9743, isbn 3-540-35726-2, 1Vol, 26 p.Conference Paper